­
­
­
­

Inventi Impact: Computational Mathematics

Articles

  • Inventi:ecm/43502/21
    Planar Graphs of Maximum Degree 6 and Without Adjacent 8-Cycles Are 6-Edge-Colorable
    01-Oct-2021 Research 2021 : October-December
    Wenwen Zhang

    In this paper, by applying the discharging method, we show that if G is a planar graph with a maximum degree of Δ � 6 that does not contain any adjacent 8-cycles, then G is of class 1.

    How to Cite this Article
    Attribution/ CC Compliant Citation: Zhang, Wenwen. "Planar Graphs of Maximum Degree 6 and without Adjacent 8-Cycles Are 6-Edge-Colorable." Journal of Mathematics 2021 (2021). https://doi.org/10.1155/2021/3562513 http://creativecommons.org/licenses/by/4.0/ Some formatting elements, header, footer, logos, dates and pagination were modified while adapting this article.
    Download Full Text